A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
نویسندگان
چکیده
منابع مشابه
Variable Neighbourhood Search for Nurse Rostering Problems
Nurse rostering problems consist of assigning varying tasks, represented as shift types, to hospital personnel with different skills and work regulations. We want to satisfy as many constraints and personal preferences as possible while constructing a schedule which meets the personnel requirements of the hospital over a predefined planning period. Real world situations are often so constrained...
متن کاملA hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
This paper is concerned with the development of intelligent decision support methodologies for nurse rostering problems in large modern hospital environments. We present an approach which hybridises heuristic ordering with variable neighbourhood search. We show that the search can be extended and the solution quality can be significantly improved by the careful combination and repeated use of h...
متن کاملA hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
This paper presents a hybrid multi-objective model that combines Integer Programming (IP) and Variable Neighbourhood Search (VNS) to deal with highly constrained nurse rostering problems in modern hospital environments. An IP is first used to solve the subproblem which includes the full set of hard constraints and a subset of soft constrains. A basic VNS then follows as a postprocessing procedu...
متن کاملA Hybrid Tabu Search Algorithm for the Nurse Rostering Problem
This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research were applied) tackled manually. The problem basically concerns the assignment of duties to a set of people with different qualifications, work regulations and preferences. Constraint programming and linear programming techniques ...
متن کاملA Hybrid Constraint Programming Approach for Nurse Rostering Problems
Due to the complexity of nurse rostering problems (NRPs), Constraint Programming (CP) approaches on their own have shown to be ineffective in solving these highly constrained problems. We investigate a two-stage hybrid CP approach on real world benchmark NRPs. In the first stage, a constraint satisfaction model is used to generate weekly rosters consist of high quality shift sequences satisfyin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial & Management Optimization
سال: 2021
ISSN: 1553-166X
DOI: 10.3934/jimo.2020058